# 剑指 Offer 04. 二维数组中的查找


# class Solution(object):
#     def findNumberIn2DArray(self, matrix, target):
#         if len(matrix) == 0:
#             return False;
        
#         row = len(matrix)
#         col = len(matrix[0])
#         x = 0
#         y = col -1

#         while x < row and y >= 0:
#             if target > matrix[x][y]:
#                 x += 1
#             elif target < matrix[x][y]:
#                 y -= 1
#             else:
#                 return True

#         return False;




 # 剑指 Offer 05. 替换空格

# class Solution:
#     def replaceSpace(self, s: str) -> str:
#         answer = str()

#         for i in s:
#             if i != ' ':
#                 answer += i
#             else:
#                 answer += "%20"

#         return answer


# 剑指 Offer 06. 从尾到头打印链表
# class Solution:
#     def reversePrint(self, head: ListNode) -> List[int]:
#         if head == None:
#             return []
        
#         list1 = list()
#         while head != None:
#             list1.append(head.val)
#             head = head.next
        
#         list1.reverse()
#         return list1



a = 10
def fun():
    a += 1



fun()

# print(a)